Approximation result toward nearest neighbor heuristic
نویسندگان
چکیده
منابع مشابه
In-Route Nearest Neighbor Queries: A Summary of Result
Nearest neighbor query is one of the most important operations in spatial databases and their application domains, such as location-based services and advanced traveler information systems . This paper addresses the problem of finding the in-route nearest neighbor (IRNN) for a query object tuple which consists of a given route with a destination and a current location on it. The IRNN is a facil...
متن کاملA Clustering Heuristic by Effective Nearest Neighbor Selection
We introduce a clustering heuristic based on an effective nearest neighbor search procedure by reducing the TSP (Traveling Saleman Problem) tour length. This technique contributes to the improvement of the TSP solutions and also provides a technique of finding cluster center in a large domain where finding the center point of data clusters is a difficult problem as the huge volume of data is no...
متن کاملAn Efficient Approximation-elimination Algorithm for Fast Nearest-neighbor Search
In this paper, we present an efficient algorithm for fast nearest-neighbour search in multidimensional space under a so called approximation-elimination framework. The algorithm is based on a new approximation procedure which selects codevectors for distance computation in the close proximity of the test vector and eliminates codevectors using the triangle inequality based elimination. The algo...
متن کاملFast nearest-neighbor search algorithms based on approximation-elimination search
In this paper, we provide an overview of fast nearest-neighbor search algorithms based on an &approximation}elimination' framework under a class of elimination rules, namely, partial distance elimination, hypercube elimination and absolute-error-inequality elimination derived from approximations of Euclidean distance. Previous algorithms based on these elimination rules are reviewed in the cont...
متن کاملSubspace Approximation for Approximate Nearest Neighbor Search in NLP
Most natural language processing tasks can be formulated as the approximated nearest neighbor search problem, such as word analogy, document similarity, machine translation. Take the questionanswering task as an example, given a question as the query, the goal is to search its nearest neighbor in the training dataset as the answer. However, existing methods for approximate nearest neighbor sear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: YUJOR
سال: 2002
ISSN: 0354-0243,1820-743X
DOI: 10.2298/yjor0201011m